Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
نویسندگان
چکیده
منابع مشابه
Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
Article history: Received 22 February 2012 Accepted 20 May 2013 Available online 7 June 2013 Submitted by E. Zerz
متن کاملSolving sparse linear equations over finite fields
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algor...
متن کاملChallenges in Solving Large Sparse Linear Systems over Finite Fields∗
This talk outlines how very large, sparse linear systems arise in the solution of problems of interest in computational number theory and public-key cryptography, such as the integer factorization and discrete logarithm problems. The linear systems are over finite fields, often the field GF(2) of two elements. We describe some algorithms for solving large sparse linear systems over GF(2), and c...
متن کاملSolving Large Sparse Linear Systems over Finite Fields
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over nite elds. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can be solved eeciently by using combinations of structured Gaussian elimination and the conjugate gradie...
متن کاملOn solving sparse algebraic equations over finite fields II
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In this paper deterministic AgreeingGluing algorithm introduced earlier in [9] for solving such equations is studied. Its expected running time on uniformly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.05.016